Algorithms for Maximizing the Volume of Intersection of Polytopes
نویسندگان
چکیده
In this paper, we address the problem of maximizing the volume of the intersection of polytopes in R by translation. We show that (1) the dth root of the objective function is concave, thus the problem can be solved oracle polynomial time by ellipsoidal method, and (2) the problem can be solved in strongly polynomial time in dimension two even for non-convex polygons.
منابع مشابه
An FPTAS for the Volume of Some V -polytopes - It is Hard to Compute the Volume of the Intersection of Two Cross-Polytopes
Given an n-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio (n/ logn). There is a substantial progress on randomized approximation such as Markov chain Monte Carlo for a highdimensional volume, and for many #P-hard problems, while some deterministic approximation algorithms are rece...
متن کاملروابط جدید زمان چرخه بهینه برای تقاطع‌های پیش‌زمان‌بندی شده مستقل با تغییر رابطه وبستر براساس روش HCM 2000
When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...
متن کاملVolume difference inequalities for the projection and intersection bodies
In this paper, we introduce a new concept of volumes difference function of the projection and intersection bodies. Following this, we establish the Minkowski and Brunn-Minkowski inequalities for volumes difference function of the projection and intersection bodies.
متن کاملOrder-Chain Polytopes
Given two families X and Y of integral polytopes with nice combinatorial and algebraic properties, a natural way to generate new class of polytopes is to take the intersection P = P1 ∩ P2, where P1 ∈ X, P2 ∈ Y . Two basic questions then arise: 1) when P is integral and 2) whether P inherits the “old type” from P1,P2 or has a “new type”, that is, whether P is unimodularly equivalent to some poly...
متن کاملتحلیل ظرفیت و تأخیر در میادین و مقایسه آن با تقاطع‌های چراغدار
Roundabout is one of the most effective intersection control methods in the world. Although, they have often been used in Iran, but, the methods which are proposed to analyze roundabouts are very old and new regulations are not implemented for analyzing modern roundabouts. There are strong needs to apply new modern analyzing methods for studying roundabouts in Iran. Also, these methods should b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006